Exhaustive approaches to 2D rectangular perfect packings
نویسندگان
چکیده
In this paper, we consider the two-dimensional rectangular strip packing problem, in the case where there is a perfect packing; that is, there is no wasted space. One can think of the problem as a jigsaw puzzle with oriented rectangular pieces. Although this comprises a quite special case for strip packing, we have found it useful as a subroutine in related work. We demonstrate a simple pruning approach that makes a branch-and-bound-based exhaustive search extremely effective for problems with less than 30 rectangles. 2004 Published by Elsevier B.V.
منابع مشابه
The Regularity Lemma and applications to packings in graphs
In this thesis we investigate applications of Szemerédi’s Regularity Lemma [20]. This result was originally formulated to solve number-theoretical problems. However, we consider its applications in graph theory, in particular to packing results. We begin by introducing some of the basic notions that are needed to understand and use the Regularity Lemma. From this we give an outline of some tool...
متن کاملOrthogonal Packings in Two Dimensions
We consider problems of packing an arbitrary collection of rectangular pieces into an open-ended, rectangular bin so as to minimize the height achieved by any piece. This problem has numerous applications in operations research and studies of computer operation. We devise efficient approximation algorithms, study their limitations, and derive worst-case bounds on the performance of the packings...
متن کاملCLP Approaches to 2D Angle Placements
The paper presents two CLP approaches to 2D angle placements, implemented in CHIP v.5.3. The first is based on the classical (rectangular) cumulative global constraint, the second on the new trapezoidal cumulative global constraint. Both approaches are applied to a specific presented.
متن کاملPerfect domination in regular grid graphs
We show there is an uncountable number of parallel total perfect codes in the integer lattice graph Λ of R. In contrast, there is just one 1-perfect code in Λ and one total perfect code in Λ restricting to total perfect codes of rectangular grid graphs (yielding an asymmetric, Penrose, tiling of the plane). We characterize all cycle products Cm × Cn with parallel total perfect codes, and the d-...
متن کاملUnderconstrained jammed packings of nonspherical hard particles: ellipses and ellipsoids.
Continuing on recent computational and experimental work on jammed packings of hard ellipsoids [Donev, Science 303, 990 (2004)] we consider jamming in packings of smooth strictly convex nonspherical hard particles. We explain why an isocounting conjecture, which states that for large disordered jammed packings the average contact number per particle is twice the number of degrees of freedom per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 90 شماره
صفحات -
تاریخ انتشار 2004